Coloring perfect graphs with no balanced skew-partitions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coloring perfect graphs with no balanced skew-partitions

We present an O(n) algorithm that computes a maximum stable set of any perfect graph with no balanced skew-partition. We present O(n) time algorithm that colors them.

متن کامل

Finding balanced skew partitions in perfect graphs

A graph G is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one; and it is known that this is equivalent to being perfect, that is, that the chromatic number of every induced subgraph equals the size of its largest clique. A skew partition in G is a partition (A,B) of V (G) such that G[A] is not connected and G[B] is not connected; and it is balan...

متن کامل

Clique-Stable Set separation in perfect graphs with no balanced skew-partitions

We prove that perfect graphs with no balanced skew-partitions admits a O(n) Clique-Stable set separator. We then prove that for every graph G in this class, there always exists two subsets of vertices V1, V2 such that |V1|, |V2| ≥ c|V (G)| for some constant c and V1 is either complete or anticomplete to V2. The method uses trigraphs, introduced by Chudnovsky [5], and relies on the good behavior...

متن کامل

Clique Stable separation in perfect graphs with no balanced skew-partitions

We prove that perfect graphs with no balanced skew-partitions admits a O(n) Clique-Stable separator. We then prove that for every graph G in this class, there always exists two subsets of vertices V1, V2 such that |V1|, |V2| ≥ c|V (G)| for some constant c and V1 is either complete or anticomplete to V2. The method uses trigraphs, introduced by Chudnovsky [5], and relies on the good behavior of ...

متن کامل

Skew partitions in perfect graphs

We discuss some new and old results about skew partitions in perfect graphs. © 2007 Published by Elsevier B.V.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 2015

ISSN: 0095-8956

DOI: 10.1016/j.jctb.2015.04.007